Ant colony optimization and local search for bin packing and cutting stock problems
نویسندگان
چکیده
منابع مشابه
Ant colony optimization and local search for bin packing and cutting stock problems
The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimization problems. Exact solution methods can only be used for very small instances, so for real-world problems, we have to rely on heuristic methods. In recent years, researchers have started to apply evolutionary approaches to these problems, including Genetic Algorithms and Evolutionary...
متن کاملAnt Colony Optimisation and Local Search for Bin Packing and Cutting Stock Problems
The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimisation problems. Exact solution methods can only be used for very small instances, so for real-world problems we have to rely on heuristic methods. In recent years, researchers have started to apply evolutionary approaches to these problems, including Genetic Algorithms and Evolutionary ...
متن کاملLP models for bin packing and cutting stock problems
We review several linear programming (LP) formulations for the one-dimensional cutting stock and bin packing problems, namely, the models of Kantorovich, Gilmore–Gomory, onecut models, as in the Dyckhoff–Stadtler approach, position-indexed models, and a model derived from the vehicle routing literature. We analyse some relations between the corresponding LP relaxations, and their relative stren...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملThe Cutting-Stock Approach to Bin Packing: Theory and Experiments
We report on an experimental study of the Gilmore-Gomory cutting-stock heuristic and related LP-based approaches to bin packing, as applied to instances generated according to discrete distributions. No polynomial running time bound is known to hold for the Gilmore-Gomory approach, and empirical operation counts suggest that no straightforward implementation can have average running time O(m), ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2004
ISSN: 0160-5682,1476-9360
DOI: 10.1057/palgrave.jors.2601771